Genetic Algorithms with Double Strings for Multidimensional Integer Knapsack Problems
نویسندگان
چکیده
منابع مشابه
Genetic Algorithms for 0/1 Multidimensional Knapsack Problems
An important class of combinatorial optimization problems are the Multidimensional 0/1 Knapsacks, and various heuristic and exact methods have been devised to solve them. Among these, Genetic Algorithms have emerged as a powerful new search paradigms. We show how a proper selection of parameters and search mechanisms lead to an implementation of Genetic Algorithms that yields high quality solut...
متن کاملUpper Bounds for Large Scale Integer Quadratic Multidimensional Knapsack Problems
We consider the separable quadratic multi-knapsack problem (QMKP) which consists in maximizing a concave separable quadratic integer function subject to m linear capacity constraints. The aim of this paper is to develop an effective method to compute an upper bound for (QMKP) from a surrogate relaxation originally proposed in Djerdjour et al. (1988). The quality of three other upper bounds for...
متن کاملGenetic algorithms with decomposition procedures for multidimensional 0-1 knapsack problems with block angular structures
This paper presents a detailed treatment of genetic algorithms with decomposition procedures as developed for large scale multidimensional 0-1 knapsack problems with block angular structures. Through the introduction of a triple string representation and the corresponding decoding algorithm, it is shown that a potential solution satisfying not only block constraints but also coupling constraint...
متن کاملOverview of the Algorithms for Solving the Multidimensional Knapsack Problems
The multidimensional knapsack problem is defined as an optimization problem that is NP-hard combinatorial. The multidimensional knapsack problems have large applications, which include many applicable problems from different area, like cargo loading, cutting stock, bin-packing, financial and other management, etc. This paper reviews some researches published in the literature. The concentrate i...
متن کاملInteger knapsack problems with set-up weights
The Integer Knapsack Problem with Set-up Weights (IKPSW) is a generalization of the classical Integer Knapsack Problem (IKP), where each item type has a set-up weight that is added to the knapsack if any copies of the item type are in the knapsack solution. The k-item IKPSW (kIKPSW) is also considered, where a cardinality constraint imposes a value k on the total number of items in the knapsack...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Japan Society for Fuzzy Theory and Systems
سال: 2000
ISSN: 0915-647X,2432-9932
DOI: 10.3156/jfuzzy.12.4_104